Hamilton Cycles in Almost-Regular 2-Connected Graphs
نویسندگان
چکیده
منابع مشابه
Hamilton cycles in regular 3-connected graphs
This result is best possible for k = 3 since the Petersen graph is a nonhamiltonian, 2-connected, 3-regular graph on 10 vertices. It is essentially best possible for k > 4 since there exist non-hamiltonian, 2-connected, kregular graphs on 3k + 4 vertices for k even, and 3k + 5 vertices for all k. Examples of such graphs are given in [ 1, 3 1. The problem of determining the values of k for which...
متن کاملHamilton cycles in 5-connected line graphs
A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected line graph of minimum degree at least 6 is hamiltonian. The result extends to claw-free graphs and to Hamilton-connectedness.
متن کاملRainbow Hamilton cycles in random regular graphs
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n→∞, for fixed d ≥ 8.
متن کاملCycles in 2-connected graphs
Let Gn be a class of graphs on n vertices. For an integer c, let ex(Gn, c) be the smallest integer such that if G is a graph in Gn with more than ex(Gn, c) edges, then G contains a cycle of length more than c. A classical result of Erdös and Gallai is that if Gn is the class of all simple graphs on n vertices, then ex(Gn, c) = c 2 (n − 1). The result is best possible when n − 1 is divisible by ...
متن کاملEnumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs
We describe an algorithm which enumerates all Hamilton cycles of a given 3regular n-vertex graph in time O(1.276n), improving on Eppstein’s previous bound. The resulting new upper bound of O(1.276n) for the maximum number of Hamilton cycles in 3-regular n-vertex graphs gets close to the best known lower bound of Ω(1.259n). Our method differs from Eppstein’s in that he considers in each step a n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1993
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1007